A Machine-checked Theory of Oating Point Arithmetic

نویسنده

  • John Harrison
چکیده

Intel is applying formal veriication to various pieces of mathematical software used in Merced, the rst implementation of the new IA-64 architecture. This paper discusses the development of a generic oating point library giving deenitions of the fundamental terms and containing formal proofs of important lemmas. We also brieey describe how this has been used in the veriication eeort so far.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Floating Point Veriication in Hol Light: the Exponential Function

In that they often embody compact but mathematically sophisticated algorithms , operations for computing the common transcendental functions in oating point arithmetic seem good targets for formal veriication using a mechanical theorem prover. We discuss some of the general issues that arise in veriications of this class, and then present a machine-checked veriication of an algorithm for comput...

متن کامل

Floating Point Verification in HOL Light: The Exponential Function

Since they often embody compact but mathematically sophisticated algorithms , operations for computing the common transcendental functions in oating point arithmetic seem good targets for formal veriication using a mechanical theorem prover. We discuss some of the general issues that arise in veriications of this class, and then present a machine-checked veriication of an algorithm for computin...

متن کامل

On Formally Correct Implementation of IEEE Computer Arithmetic

IEEE oating-point arithmetic standards 754 and 854 re ect the present state of the art in designing and implementing oating-point arithmetic units. A formalism applied to a standard non-trapping mode oating-point system shows incorrectness of some numeric and non-numeric results. A software emulation of decimal oating-point computer arithmetic supporting an enhanced set of exception symbols is ...

متن کامل

A Mechanically Checked Proof of theCorrectness of the Kernel of the AMD 5 K 86

We describe a mechanically checked proof of the correctness of the kernel of the oating point division algorithm used on the AMD5 K 86 microprocessor. The kernel is a non-restoring division algorithm that computes the oating point quotient of two double extended precision oating point numbers, p and d (d 6 = 0), with respect to a rounding mode, mode. The algorithm is deened in terms of oating p...

متن کامل

Double Precision Geometry: A General Technique for Calculating Line and Segment Intersections Using Rounded Arithmetic

We show for the rst time how to reduce the cost of performing speciic geometric constructions by using rounded arithmetic instead of exact arithmetic. Exploiting a property of oating point arithmetic called monotonicity, a new technique, double precision geometry, can replace exact arithmetic with rounded arithmetic in any eecient algorithm for computing the set of intersections of a set of lin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999